A Heuristic Screening Method for Graph-Based Simulation Models
نویسندگان
چکیده
This paper presents a heuristic factor screening method for identifying important input factors in large synchronous data flow simulation models from an analysis based on those models’ underlying structures. Data flow requires encoding a model components’ dependencies in a graph format. The presented method views this graph as a stochastic process and attempts to rank the importance of inputs with respect to an output through the use of weighted random-walks through that graph. A comparison is made against other factor screening techniques, including fractional factorial experiments.
منابع مشابه
Adaptive Tuning of Model Predictive Control Parameters based on Analytical Results
In dealing with model predictive controllers (MPC), controller tuning is a key design step. Various tuning methods are proposed in the literature which can be categorized as heuristic, numerical and analytical methods. Among the available tuning methods, analytical approaches are more interesting and useful. This paper is based on a proposed analytical MPC tuning approach for plants can be appr...
متن کاملSoil and Rock Slope Stability Analysis based on Numerical Manifold Method and Graph Theory
Limit equilibrium method, strength reduction method and Finite Difference Methods are the most prevalently used methods for soil and rock slope stability analysis. However, it can be mention that those have some limitations in practical application. In the Limit equilibrium method, the constitutive model cannot be considered and many assumptions are needed between slices of soil and rock. The s...
متن کاملA PFIH-Based Heuristic for Green Routing Problem with Hard Time Windows
Transportation sector generates a considerable part of each nation's gross domestic product and considered among the largest consumers of oil products in the world. This paper proposes a heuristic method for the vehicle routing problem with hard time windows while incorporating the costs of fuel, driver, and vehicle. The proposed heuristic uses a novel speed optimization algorithm to reach its ...
متن کاملSampling from social networks’s graph based on topological properties and bee colony algorithm
In recent years, the sampling problem in massive graphs of social networks has attracted much attention for fast analyzing a small and good sample instead of a huge network. Many algorithms have been proposed for sampling of social network’ graph. The purpose of these algorithms is to create a sample that is approximately similar to the original network’s graph in terms of properties such as de...
متن کاملAn Optimal Approach to Local and Global Text Coherence Evaluation Combining Entity-based, Graph-based and Entropy-based Approaches
Text coherence evaluation becomes a vital and lovely task in Natural Language Processing subfields, such as text summarization, question answering, text generation and machine translation. Existing methods like entity-based and graph-based models are engaging with nouns and noun phrases change role in sequential sentences within short part of a text. They even have limitations in global coheren...
متن کامل